skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Eddy, Jillian"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, ICML Workshop of AI for Math)
    We introduce IRIS, a geometric and heuristic-based scoring system for evaluating mathematical conjectures and theorems expressed as linear inequalities over numerical invariants. The IRIS score reflects multiple dimensions of significance—including sharpness, diversity, difficulty, and novelty—and enables the principled ranking of conjectures by their structural importance. As a tool for fully automated discovery, IRIS supports the generation and prioritization of high-value conjectures. We demonstrate its utility through case studies in convex geometry and graph theory, showing that IRIS can assist in both rediscovery of known results and proposal of novel, nontrivial conjectures. 
    more » « less
    Free, publicly-accessible full text available August 15, 2026
  2. ; ; ; ; (, Proceedings of the London Mathematical Society)
    Abstract Markoff mod‐ graphs are conjectured to be connected for all primes . In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all . We also provide a method that quickly verifies connectivity for many primes below this bound. In our study of Markoff mod‐ graphs, we introduce the notion ofmaximal divisorsof a number. We prove sharp asymptotic and explicit upper bounds on the number of maximal divisors, which ultimately improves the Markoff graph ‐bound by roughly 140 orders of magnitude as compared with an approach using all divisors. 
    more » « less